A polynomial generalization of the Euler characteristic for algebraic sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets

We give algorithms with polynomially bounded complexities (for fixed degrees) for computing the generalized Euler-Poincaré characteristic of semi-algebraic sets defined by symmetric polynomials. This is in contrast to the best complexity of the known algorithms for the same problem in the non-symmetric situation, which is singly exponential. This singly exponential complexity for the latter pro...

متن کامل

A Generalization of the Characteristic Polynomial of a Graph

Given a graph G with its adjacency matrix A, the characteristic polynomial of G is defined as det(A − λI). Two graphs which have the same characteristic polynomial are called cospectral. It is known (see [2]) that there are non-isomorphic graphs which are co-spectral. In this note we consider the following generalization of the characteristic polynomial of a graph: For a graph G with adjacency ...

متن کامل

Algebraic characteristic sets of matroids

For a matroid M, define the algebraic characteristic set x4(M) to be the set of field characteristics over which M can be algebraically represented. We construct many examples of rank three matroids with finite, non-singleton algebraic characteristic sets. We also determine x,,(PG(Z, p)) and xa(AG(2, p)). An infinite family of rank three matroids with empty algebraic characteristic set is const...

متن کامل

The Euler characteristic as a polynomial in the Chern classes

In this paper we obtain some explicit expressions for the Euler characteristic of a rank n coherent sheaf F on P and of its twists F(t) as polynomials in the Chern classes ci(F), also giving algorithms for the computation. The employed methods use techniques of umbral calculus involving symmetric functions and Stirling numbers. Introduction The aim of this paper is to find a general polynomial ...

متن کامل

About the Euler-poincaré Characteristic of Semi-algebraic Sets Defined with Two Inequalities

We express the Euler-Poincaré characteristic of a semi-algebraic set, which is the intersection of a non-singular complete intersection with two polynomial inequalities, in terms of the signatures of appropriate bilinear symmetric forms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Singularities

سال: 2012

ISSN: 1949-2006

DOI: 10.5427/jsing.2012.4g